Aperiodic pseudorandom number generators based on infinite words
نویسندگان
چکیده
منابع مشابه
Aperiodic pseudorandom number generators based on infinite words
In this paper we study how certain families of aperiodic infinite words can be used to produce aperiodic pseudorandom number generators (PRNGs) with good statistical behavior. We introduce the well distributed occurrences (WELLDOC) combinatorial property for infinite words, which guarantees absence of the lattice structure defect in related pseudorandom number generators. An infinite word u on ...
متن کاملEmpirical Pseudorandom Number Generators
The most common pseudorandom number generator or PRNG, the linear congruential generator or LCG, belongs to a whole class of rational congruential generators. These generators work by multiplicative congruential method for integers, which implements a ”grow-and-cut procedure”. We extend this concept to real numbers and call this the real congruence, which produces another class of random number...
متن کاملPseudorandom Number Generators Based on Chaotic Dynamical Systems
Pseudorandom number generators are used in many areas of contemporary technology such as modern communication systems and engineering applications. In recent years a new approach to secure transmission of information based on the application of the theory of chaotic dynamical systems has been developed. In this paper we present a method of generating pseudorandom numbers applying discrete chaot...
متن کاملCryptanalytic Attacks on Pseudorandom Number Generators
In this paper we discuss PRNGs: the mechanisms used by real-world secure systems to generate cryptographic keys, initialization vectors, “random” nonces, and other values assumed to be random. We argue that PRNGs are their own unique type of cryptographic primitive, and should be analyzed as such. We propose a model for PRNGs, discuss possible attacks against this model, and demonstrate the app...
متن کاملSum-discrepancy test on pseudorandom number generators
We introduce a non-empirical test on pseudorandom number generators (prng), named sum-discrepancy test. We compute the distribution of the sum of consecutive m outputs of a prng to be tested, under the assumption that the initial state is uniformly randomly chosen. We measure its discrepancy from the ideal distribution, and then estimate the sample size which is necessary to reject the generato...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2016
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2016.07.042